Path Planning in Swarm Robots using Particle Swarm Optimisation on Potential Fields

نویسندگان

  • Sanjay Sarma
  • Deepak Jayaraj
  • Swagatam Das
  • Ajith Abraham
  • S. M. GiriRajkumar
  • Dr K. Ramkumar
  • George A. Bekey
چکیده

This article presents a novelimplementation of Particle Swarm Optimisation(PSO)forfinding the most optimal solution to path planning problem for a swarm of robots. The swarm canvasses through the configuration space having static obstaclesby applying PSO on potential fields generated by the target. The best possible path by the momentary leaders of the group is retraced toget the solution. The designed algorithm was simulated on a specially developed simulator adhering to real time constraints and conditions faced by the mobile robots. The solutions for various configuration spaces are presented to verify the effectiveness of the algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization

Motion planning is a key element of robotics since it empowers a robot to navigate autonomously. Particle Swarm Optimization is a simple, yet a very powerful optimization technique which has been effectively used in many complex multi-dimensional optimization problems. This paper proposes a path planning algorithm based on particle swarm optimization for computing a shortest collision-free path...

متن کامل

On-line Path Planning for Mobile Robots in Dynamic Environments

Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...

متن کامل

Particle Swarm Optimization of Potential Fields for Obstacle Avoidance

This paper addresses the safe navigation of multiple nonholonomic mobile robots in shared areas. Obstacle avoidance for mobile robots is performed by artificial potential fields and special traffic rules. In addition, the behavior of mobile robots is optimized by particle swarm optimization (PSO). The control of non-holonomic vehicles is performed using the virtual leader principle together wit...

متن کامل

Path Planning for Swarms by Combining Probabilistic Roadmaps and Potential Fields

This paper combines probabilistic roadmaps with potential fields in order to enable a robotic swarm to effectively move to a desired destination while avoiding collisions with obstacles and each other. Potential fields provide the robots with local, reactive, behaviors that seek to keep the swarm moving in cohesion and away from the obstacles. The probabilistic roadmap provides global path plan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012